A Distributed Fixed-Point Algorithm for Extended Dependency Graphs*
نویسندگان
چکیده
منابع مشابه
Extended Dependency Graphs and Efficient Distributed Fixed-Point Computation
Equivalence and model checking problems can be encoded into computing fixed points on dependency graphs. Dependency graphs represent causal dependencies among the nodes of the graph by means of hyper-edges. We suggest to extend the model of dependency graphs with so-called negation edges in order to increase their applicability. The graphs (as well as the verification problems) suffer from the ...
متن کاملDistributed Computation of Fixed Points on Dependency Graphs
Dependency graph is an abstract mathematical structure for representing complex causal dependencies among its vertices. Several equivalence and model checking questions, boolean equation systems and other problems can be reduced to fixed-point computations on dependency graphs. We develop a novel distributed algorithm for computing such fixed points, prove its correctness and provide an efficie...
متن کاملDALD:-Distributed-Asynchronous-Local-Decontamination Algorithm in Arbitrary Graphs
Network environments always can be invaded by intruder agents. In networks where nodes are performing some computations, intruder agents might contaminate some nodes. Therefore, problem of decontaminating a network infected by intruder agents is one of the major problems in these networks. In this paper, we present a distributed asynchronous local algorithm for decontaminating a network. In mos...
متن کاملA Distributed Algorithm for Computing a Common Fixed Point of a Finite Family of Paracontractions
A distributed algorithm is described for finding a common fixed point of a family ofm > 1 nonlinear maps Mi : R n → R assuming that each map is a paracontraction and that at least one such common fixed point exists. The common fixed point is simultaneously computed by m agents assuming each agent i knows only Mi, the current estimates of the fixed point generated by its neighbors, and nothing m...
متن کاملA Distributed Algorithm for Computing a Common Fixed Point of a Family of Paracontractions
Abstract: A distributed algorithm is described for finding a common fixed point of a family of m > 1 nonlinear maps Mi : IR n → IR assuming that each map is a paracontraction. The common fixed point is simultaneously computed by m agents assuming each agent i knows only Mi, the current estimates of the fixed point generated by its neighbors, and nothing more. Each agent recursively updates its ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Fundamenta Informaticae
سال: 2018
ISSN: 0169-2968,1875-8681
DOI: 10.3233/fi-2018-1707